package Queue.MinPriorityQueue;

public class Test {
    public static void main(String[] args) {
        MinPriorityQueue<Integer> queue = new MinPriorityQueue<>(10);
        queue.insert(1);
        queue.insert(3);
        queue.insert(2);
        queue.insert(4);
        queue.insert(5);
        //从队列中获取最小元素
        while(!queue.isEmpty()){
            System.out.print(queue.deleteMin()+" ");
        }
    }
}
